Query , PACS and simple - PAC Learning
نویسنده
چکیده
We study a distribution dependent form of PAC learning that uses probability distributions related to Kolmogorov complexity. We relate the PACS model, deened by Denis, D'Halluin and Gilleron in 3], with the standard simple-PAC model and give a general technique that subsumes the results in 3] and 6].
منابع مشابه
General Bounds on Statistical Query Learning and PAC Learning with Noise via Hypothesis Bounding
We derive general bounds on the complexity of learning in the Statistical Query model and in the PAC model with classification noise. We do so by considering the problem of boosting the accuracy of weak learning algorithms which fall within the Statistical Query model. This new model was introduced by Kearns [12] to provide a general framework for efficient PAC learning in the presence of class...
متن کاملTight Bounds on Proper Equivalence Query Learning of DNF
We prove a new structural lemma for partial Boolean functions f , which we call the seed lemma for DNF. Using the lemma, we give the first subexponential algorithm for proper learning of poly(n)-term DNF in Angluin’s Equivalence Query (EQ) model. The algorithm has time and query complexity 2 √ , which is optimal. We also give a new result on certificates for DNF-size, a simple algorithm for pro...
متن کاملA Note on Learning from Multiple - InstanceExamplesAVRIM BLUM
We describe a simple reduction from the problem of PAC-learning from multiple-instance examples to that of PAC-learning with one-sided random classiication noise. Thus, all concept classes learnable with one-sided noise, which includes all concepts learnable in the usual 2-sided random noise model plus others such as the parity function, are learnable from multiple-instance examples. We also de...
متن کاملA Note on Learning from Multiple - Instance
We describe a simple reduction from the problem of PAC-learning from multiple-instance examples to that of PAC-learning with one-sided random classi cation noise. Thus, all concept classes learnable with one-sided noise, which includes all concepts learnable in the usual 2-sided random noise model plus others such as the parity function, are learnable from multiple-instance examples. We also de...
متن کاملA Query Algorithm for Agnostically Learning DNF?
Motivation: One of the most celebrated results in computational learning theory is Jackson’s query algorithm for PAC learning DNF formulas with respect to the uniform distribution [3]. A natural question is whether DNF formulas can be learned (even with queries and with respect to the uniform distribution) in a highly noisy setting, i.e., the wellknown agnostic framework of learning [5]. Additi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007